A Dynamic Communication Contention Awareness List Scheduling Algorithm for Arbitrary Heterogeneous System
نویسندگان
چکیده
Task scheduling is an essential aspect of parallel process system. Most heuristics for this NP-hard problem assume fully connected homogeneous processors and ignore contention on the communication links. Actually, contention for communication resources has a strong influence on the execution time of a parallel program in arbitrary network topology heterogeneous system. This paper investigates the incorporation of contention awareness into task scheduling. The innovation is the idea of dynamic scheduling edges to links, which we use the earliest communication finish time search algorithm based on shortestpath search algorithm. The other novel idea proposed in this paper is scheduling priority based on recursive rank computation on heterogeneous arbitrary architectures. The comparison study, based on randomly generated graphs, shows that our scheduling algorithm significantly surpass classic and static communication contention awareness algorithm, especially for high data transmission rate parallel application
منابع مشابه
List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a directed acyclic graph (DAG) to a target system. As most scheduling heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the communication links. This article extends the list scheduling heuristic for contention aware...
متن کاملPareto Front Based Realistic Soft Real-Time Task Scheduling with Multi-objective Genetic Algorithm in Unstructured Heterogeneous Distributed System
Task scheduling is an essential aspect of parallel processing system. This problem assumes fully connected processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. In this paper, we propose multi-objective genetic algorithm to solve task scheduling...
متن کاملCommunication-aware Fault-tolerant Scheduling Strategy for Precedence Constrained Tasks in Heterogeneous Distributed Systems
Abstract Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. Primary-backup approach is a common methodology used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. For independent tasks, the backup copy can overload with other backup copies on the same pr...
متن کاملBubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures
We propose an algorithm for scheduling and allocation of parallel programs to message-passing architectures. The algorithm considers arbitrary computation and communication costs, arbitrary network topology, link contention and underlying communication routing strategy. While our technique is static, the algorithm is quasi dynamic because it is not specific to any particular system topology and...
متن کاملCommunication Scheduling in Parallel Task Executions on Large Parallel Systems
Scheduling is an important issue in parallel processing. Most scheduling algorithms makes assigns tasks in a direct acyclic graph (DAG) to processors. Usually only the allocation and ordering of tasks are considered, and sometimes communication time is included in the determination of priorities of the tasks, however, communication messages are not explicitly scheduled. Moreover, communication ...
متن کامل